Algebra of Monotonic Boolean Transformers
نویسنده
چکیده
Algebras of imperative programming languages have been successful in reasoning about programs. In general an algebra of programs is an algebraic structure with programs as elements and with program compositions (sequential composition, choice, skip) as algebra operations. Various versions of these algebras were introduced to model partial correctness, total correctness, refinement, demonic choice, and other aspects. We formalize here an algebra which can be used to model total correctness, refinement, demonic and angelic choice. The basic model of this algebra are monotonic Boolean transformers (monotonic functions from a Boolean algebra to itself).
منابع مشابه
A Representation Theorem for System P
We prove a representation theorem for non-monotonic inference relations that are defined over elements of some Boolean algebras and obey the rules of System P. An inference relation is represented by a closure operator on the Stone space of the Boolean algebra. This representation theorem generalizes and gives new insights into existing completeness theorems for System P. Let A be a Boolean alg...
متن کاملAn Algebraic Construction of Predicate Transformers
In this paper we present an algebraic construction of monotonic predicate transformers, using a categorical construction which is similar to the algebraic construction of the integers from the natural numbers. When applied to the category of sets and total functions once, it yields a category isomorphic to the category of sets and relations; a second application yields a category isomorphic to ...
متن کاملPredicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties. We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in term...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملOn some classes of expansions of ideals in $MV$-algebras
In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate and $ (tau,sigma)$-Boolean in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011